Disjunction in Modal Description Logics
نویسنده
چکیده
We investigate the complexity of satisfaction problems in modal description logics without disjunction between formulae. It is shown that simulation of disjunction in the class of all models of these logics is possible, so that the complexity remains same no matter the logics is with or without disjunction of formulae. However, the omission of disjunction, in the class of the models based on the universal relation, “turns down” the complexity of satisfaction problem i.e., if P = NP, it is not possible to simulate disjunction.
منابع مشابه
Feasible Disjunction Property and Feasible Interpolation in Modal Logic
We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].
متن کاملConstructive Description Logics Hybrid-Style
Constructive modal logics come in several different flavours and constructive description logics, not surprisingly, do the same. We introduce an intuitionistic description logic, which we call iALC (for intuitionistic ALC, since ALC is the name of the canonical description logic system) and provide axioms, a Natural Deduction formulation and a sequent calculus for it. The system iALC is related...
متن کاملThe Expressive Power of Modal Dependence Logic
We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the expressive power of modal logic with intuitionistic disjunction and extended modal dependence ...
متن کاملRule Refinement for Semantic Tableau Calculi
This paper investigates refinement techniques for semantic tableau calculi. The focus is on techniques to reduce branching in inference rules and thus allow more effective ways of carrying out deductions. We introduce an easy to apply, general principle of atomic rule refinement, which depends on a purely syntactic condition that can be easily verified. The refinement has a wide scope, for exam...
متن کاملA New Four-valued Approach to Modal Logic
In this paper several systems of modal logic based on four-valued matrices are presented. We start with pure modal logics, i.e. modal logics with modal operators as the only operators, using the Polish framework of structural consequence relation. We show that with a four-valued matrix we can define modal operators which have the same behavior as in pure S5 (S5 with only modal operators). We th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008